#include"BSTree.h"
#define key int
#define val int

using sbtree = BSTree<key, val>;

void testtree01()
{
		sbtree tree01;
		for (int i = 0; i < 12; i++)
		{
			tree01.insert({ i,i });
		}
		tree01.inorder();
		/*sbtree tree02({ 11,11 });
		tree02.inorder();*/
}



int main()
{
	int i = 0;
	sbtree tree01;
	for (int i = 0; i < 12; i++)
	{
		tree01.insert({ i,i });
	}
	testtree01();
	return 0;
}